Randomized algorithm - PDFSEARCH.IO - Document Search Engine

Randomized algorithm
Results: 630

#	Item
181	CS 373: Combinatorial Algorithms, Spring 1999 Midterm 1 (February 23, 1999) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:54:11 Binary trees Analysis of algorithms Splay tree Randomized algorithm Fibonacci number Treap Time complexity Algorithm Factorial Mathematics Theoretical computer science Applied mathematics
182	Concepts and Algorithms for Polygonal Simplification Jonathan D. Cohen Department of Computer Science, The Johns Hopkins University 1. INTRODUCTION 1.1 Motivation Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2000-11-14 11:05:31 Polygon mesh Visual arts Tessellation Vertex 3D modeling Level of detail Polyhedron Randomized algorithm Triangle strip 3D computer graphics Geometry Computing
183	Approximately Counting Perfect Matchings in General Graphs Martin F¨ urer ∗ Shiva Prasad Kasiviswanathan Computer Science and Engineering Pennsylvania State University University Park, PA 16802. {furer, kasivisw}@cse. Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:14 Matching Computational problems Algebraic graph theory Combinatorial optimization Computing the permanent Randomized algorithm Graph factorization Adjacency matrix Bipartite graph Mathematics Graph theory Theoretical computer science
184	Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-01-20 12:03:47 Sorting algorithms Analysis of algorithms Selection algorithm Merge sort Randomized algorithm Algorithm In-place algorithm Sorted array Relational database Mathematics Theoretical computer science Applied mathematics
185	Shattering a Set of Objects in 2D Subhas C. Nandy 3 Indian Statistical Institute, Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2003-06-20 16:03:42 Euclidean plane geometry Sweep line algorithm Dual polyhedron Simple polygon Randomized algorithm Planar separator theorem Geometry Discrete geometry Arrangement of lines
186	16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory
187	Chapter 2 Leader Election 2.1 Anonymous Leader Election Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory
188	138 Chapter 13 Wireless Protocols Wireless communication was one of the major success stories of the last decades. Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Probabilistic complexity theory Randomized algorithm Mathematics Applied mathematics Chernoff bound Binary trees Finite fields Chord Tango tree Theoretical computer science Distributed data storage Analysis of algorithms
189	Algorithms Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:40 Spanning tree Combinatorial optimization Graph connectivity Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Connectivity Theoretical computer science Mathematics Graph theory
190	On the Complexity of Asynchronous Gossip Chryssis Georgiou Seth Gilbert Dept. of Computer Science, Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2008-08-26 04:43:06 Analysis of algorithms Fault-tolerant computer systems Consensus Gossip protocol Randomized algorithm Distributed computing Time complexity Gossip Theoretical computer science Computational complexity theory Applied mathematics

UPDATE